The Tree Representation Of

نویسندگان

  • Alan Robinson
  • Sarah Whitehouse
  • ALAN ROBINSON
چکیده

We show that the space of fully-grown n-trees has the homotopy type of a bouquet of spheres of dimension n ? 3 and that the character of the representation of n+1 on its only non-trivial reduced homology group is (Ind n+1 n Lie n ?Lie n+1): Introduction We investigate a certain space T n called the space of fully-grown n-trees, and we prove that it has the homotopy type of a bouquet of spheres of dimension n ? 3. The symmetric group n+1 acts in a natural way on T n , so the reduced homology of T n aaords an integral representation of n+1 , which we call the tree representation. It has dimension (n ? 1)!. Its restriction to n?1 is isomorphic (over the integers) to the regular representation. We show that the character of the tree representation is (Ind n+1 n Lie n ?Lie n+1) where is the alternating character, and Lie n is the character of the representation of n on that component of the free Lie algebra on n generators which is spanned by those words involving each generator exactly once. In the proof we use the Lefschetz xed-point theorem, and a formula of Brandt 3] to the eeect that Lie r = Ind r C r r , where r is a faithful linear character of the subgroup generated by an r-cycle in r. We became interested in the space T n because it arises in ?-homology theory for commutative rings. This is very close to the study of E 1 structures in ho-motopy theory, where T n originated 2], and to connguration spaces and free Lie algebras. The connections among these are described in 5]. Restricting the tree representation to n gives Lie n. Our Theorem 3.1 therefore implies a result on the top-dimensional homology of connguration spaces due to F. Cohen (see 6], Thm.12.3, p.302) which is also proved by completely diierent methods in 9]. The restriction to n also yields a known result, due to Stanley 11] on the homology of partition lattices: there is an explicit proof of this in Barcelo 1]. Our results were announced in 10] and 13]. Some related results have since been obtained by Hanlon 8].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

متن کامل

DEXSY2 A Dental Expert System for Diagnosis and Treatment

DEXSY2 is a dental expert system, which diagnoses oral diseases and offers a treatment course. The system which is designed and implemented from scratch is capable of diagnosing among thirty five oral diseases and offering a course of treatment for each. It uses a decision tree for its representation of knowledge, and each of its nodes contains a frame. The knowledge base of the system contains...

متن کامل

DEXSY2 A Dental Expert System for Diagnosis and Treatment

DEXSY2 is a dental expert system, which diagnoses oral diseases and offers a treatment course. The system which is designed and implemented from scratch is capable of diagnosing among thirty five oral diseases and offering a course of treatment for each. It uses a decision tree for its representation of knowledge, and each of its nodes contains a frame. The knowledge base of the system contains...

متن کامل

Comparing different stopping criteria for fuzzy decision tree induction through IDFID3

Fuzzy Decision Tree (FDT) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. When a FDT induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. Finding a proper threshold value for a stopping crite...

متن کامل

Fusion of Thermal Infrared and Visible Images Based on Multi-scale Transform and Sparse Representation

Due to the differences between the visible and thermal infrared images, combination of these two types of images is essential for better understanding the characteristics of targets and the environment. Thermal infrared images have most importance to distinguish targets from the background based on the radiation differences, which work well in all-weather and day/night conditions also in land s...

متن کامل

Plagiarism checker for Persian (PCP) texts using hash-based tree representative fingerprinting

With due respect to the authors’ rights, plagiarism detection, is one of the critical problems in the field of text-mining that many researchers are interested in. This issue is considered as a serious one in high academic institutions. There exist language-free tools which do not yield any reliable results since the special features of every language are ignored in them. Considering the paucit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996